ALGORITHMUS ZUR BESTIMMUNG VON ABSTAENDEN IN ENDLICHEN, GERICHTETEN UND UNBEWERTETEN GRAPHEN = UN ALGORITHME POUR CALCULER LES DISTANCES DANS LES GRAPHES FINIS ORIENTES ET NON VALUESBAUERSFELD G; ESSMANN C; LOHLE H et al.1972; COMPUTING; AUSTR.; DA. 1972; VOL. 10; NO 1-2; PP. 107-109; ABS. ANGLSerial Issue

DEGREES OF VERTICES IN A FRIENSSHIP GRAPH.KOTZIG A.1975; BULL. CANAD. MATH.; CANADA; DA. 1975; VOL. 18; NO 5; PP. 691-693; BIBL. 3 REF.Article

Clique transversal and clique independence on comparability graphsBALACHANDRAN, V; NAGAVAMSI, P; PANDU RANGAN, C et al.Information processing letters. 1996, Vol 58, Num 4, pp 181-184, issn 0020-0190Article

Interval graphs and searchingKIROUSIS, L. M; PAPADIMITRIOU, C. H.Discrete mathematics. 1985, Vol 55, Num 2, pp 181-184, issn 0012-365XArticle

A framework for complexity management in graph visualizationDOGRUSOZ, Ugur; GENC, Burkay.Lecture notes in computer science. 2002, pp 368-369, issn 0302-9743, isbn 3-540-00158-1, 2 p.Conference Paper

On the altitude of specified nodes in random treesPRODINGER, H.Journal of graph theory. 1984, Vol 8, Num 4, pp 481-485, issn 0364-9024Article

On the average number of nodes in a subtree of a treeJAMISON, R. E.Journal of combinatorial theory. Series B. 1983, Vol 35, Num 3, pp 207-223, issn 0095-8956Article

EDGE DISJOINT PLACEMENT OF GRAPHSSAUER N; SPENCER J.1978; J. COMBINATOR. THEORY, B; USA; DA. 1978; VOL. 25; NO 3; PP. 295-302; BIBL. 3 REF.Article

A NOTE ON COMPACT SETS IN GRAPHSLODI E; LUCCIO F.1978; RIC. DI AUTOMAT.; ITA; DA. 1978; VOL. 9; NO 1; PP. 86-91; BIBL. 1 REF.Article

THE LARGEST VERTEX DEGREE SUM FOR A TRIANGLE IN A GRAPH.EDWARDS CS.1977; BULL. LONDON MATH. SOC.; G.B.; DA. 1977; VOL. 9; NO 26; PP. 203-208; BIBL. 1 REF.Article

FORMULES ASYMPTOTIQUES POUR LA PROBABILITE DE K-CONNEXITE DES GRAPHES ALEATOIRESKEL'MANS AK.1972; TEOR. VEROJAT. PRIMEN.; S.S.S.R.; DA. 1972; VOL. 17; NO 2; PP. 253-265; ABS. ANGL.; BIBL. 12 REF.Serial Issue

AN ALGORITHM FOR PARTITIONING THE NODES OF A GRAPHBARNES ER.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 4; PP. 541-550; BIBL. 12 REF.Conference Paper

ANALYTICITY PROPERTIES AND POWER LAW ESTIMATES OF FUNCTIONS IN PERCOLATION THEORYKESTEN H.1981; J. STAT. PHYS.; ISSN 0022-4715; USA; DA. 1981; VOL. 25; NO 4; PP. 717-756; BIBL. 21 REF.Article

VERTEX-CRITICAL GRAPHS OF GIVEN DIAMETER.GLIVIAK F.1976; ACTA MATH. ACAD. SCI. HUNGAR.; HONGR.; DA. 1976; VOL. 27; NO 3-4; PP. 255-262; BIBL. 8 REF.Article

Reliability measures of E-graphsMAJUMDAR, A; GHOSHAL, J.Zeitschrift für angewandte Mathematik und Mechanik. 1996, Vol 76, pp 507-508, issn 0044-2267, SUP3Conference Paper

Monotonicity of the mean order of subtreesJAMISON, R. E.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 1, pp 70-78, issn 0095-8956Article

F-SETS IN GRAPHS.KRISHNAMOORTHY V; PARTHASARATHY KR.1978; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1978; VOL. 24; NO 1; PP. 53-60; BIBL. 3 REF.Article

ON A NEW INDEX FOR CHARACTERISING THE VERTICES OF CERTAIN NON-BIPARTITE GRAPHSMALLION RB; ROUVRAY DH.1978; STUD. SCI. MATH. HUNG.; ISSN 0081-6906; HUN; DA. 1978 PUBL. 1981; VOL. 13; NO 1-2; PP. 229-243; BIBL. 25 REF.Article

A FAST ALGORITHM FOR FINDING AN OPTIMAL ORDERING FOR VERTEX ELIMINATION ON A GRAPH.OHTSUKI T.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 1; PP. 133-145; BIBL. 9 REF.Article

A BRANCH-AND-BOUND ALGORITHM FOR PAGINATION.DUNCAN J; SCOTT LW.1975; OPER. RES.; U.S.A.; DA. 1975; VOL. 23; NO 2; PP. 240-259; BIBL. 10 REF.Article

ON PROBLEMS RELATED TO CHARACTERISTIC VERTICES OF GRAPHSSZAMKOLOWICZ L.1979; COLLOQ. MATH.; POL; DA. 1979; VOL. 42; PP. 367-375; BIBL. 3 REF.Article

DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN, MAXIMAL DEGREE.BOLLOBAS B.1977; QUART. J. MATH.; G.B.; DA. 1977; VOL. 28; NO 109; PP. 81-85; BIBL. 9 REF.Article

LINE REMOVAL ALGORITHMS FOR GRAPHS AND THEIR DEGREE LISTS.BOESCH F; HARARY F.1976; I.E.E.E. TRANS. CIRCUITS SYST.; U.S.A.; DA. 1976; VOL. 23; NO 12; PP. 778-782; BIBL. 13 REF.Article

PARTITIONS OF VERTICES.NESETRIL J; RODL V.1976; COMMENT. MATH. UNIV. CAROLINAE; CESKOSL.; DA. 1976; VOL. 17; NO 1; PP. 85-95; BIBL. 10 REF.Article

AN ALGORITHM FOR ENUMERATING ALL VERTICES OF A CONVEX POLYHEDRON.ALTHERR W.1975; COMPUTING; AUSTR.; DA. 1975; VOL. 15; NO 3; PP. 181-193; ABS. ALLEM.; BIBL. 11 REF.Article